Vehicle routing problems with multiple trips
نویسندگان
چکیده
منابع مشابه
The Vehicle Routing Problem with Multiple Trips
Non-asset based third-party logistics providers manage fleets of leased vehicles for their customers. Due to high leasing costs, minimizing the number of vehicles employed in daily operations is of primary concern to such firms. Consequently, routings that involve fewer vehicles and potentially longer travel times are favored over routings that involve additional vehicles. Constructing routes t...
متن کاملILS with Multiple Variable Neighbourhood Descendent for the Vehicle Routing Problem with Multiple Trips
This paper describes a new approach to solving the vehicle route problem with Multiple Trips. The proposed algorithm (IVNDS) is based on the Iterative Local Search meta-heuristic which uses two consecutive Variable Neighbourhood Descendent (VND) procedures in the improvement phase. The VND procedures are differentiated by the search spaces they explore. The first VND performs moves in routes of...
متن کاملSTOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES
The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...
متن کاملMemetic Algorithm for a Multi-Objective Vehicle Routing Problem with Multiple Trips
This paper considers a variant of the vehicle routing problem where vehicles are allowed to take more than one route during the working day. A restricted fleet size is used in order to serve customers’ demand. Therefore, vehicles could exceed the time horizon. The objective is to optimize both maximum overtime and routing cost. A mathematical model has been proposed for the VRPM. A memetic algo...
متن کاملProfitable Vehicle Routing Problem with Multiple Trips: Modeling and Variable Neighborhood Descent Algorithm
In this paper, we tackle a new variant of the Vehicle Routing Problem (VRP) which combines two known variants namely the Profitable VRP and the VRP with Mult iple Trips. The resulting problem may be called the Profitable Vehicle Routing Problem with Multiple Trips. The main purpose is to cover and solve a more complex realistic situation of the distribution transportation. The profitability con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2016
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-016-0306-2